Construction of Stream Ciphers from Block Ciphers and their Security
نویسنده
چکیده
With well-established encryption algorithms like DES or AES at hand, one could have the impression that most of the work for building a cryptosystem -for example a suite of algorithms for the transmission of encrypted data over the internet is already done. But the task of a cipher is very specific: to encrypt or decrypt a data block of a specified length. Given an plaintext of arbitrary length, the most simple approach would be to break it down to blocks of the desired length and to use padding for the final block. Each block is encrypted separately with the same key, which results in identical ciphertext blocks for identical plaintext blocks. This is known as Electronic Code Book (ECB) mode of operation, and is not recommended in many situations because it does not hide data patterns well. Furthermore, ciphertext blocks are independent from each other, allowing an attacker to substitute, delete or replay blocks unnoticed. The feedback modes in fact turn the block cipher into a stream cipher by using the algorithm as a keystream generator. Since every mode may yield different usage and security properties, it is necessary to analyse them in detail. For the traditional modes like Output Feedback (OFB), Cipher Feedback (CFB), Counter (CTR) and their variants, this has been done thoroughly, but there are also researches on rarely used modes like Plaintext or Key Feedback mode and combination modes like CTR-OFB and CTR-CFB. In cases where buffering is limited or when characters must be processed as they are received (e.g. in terminals) it is useful or even mandatory to use a stream cipher for en-/decryption. Furthermore, many stream ciphers are superior to block ciphers concerning error propagation. Hence building stream ciphers from block ciphers can be useful alternative to other stream ciphers. This paper aims to give an overview on these modes of operation and their security, as their understanding is imperative for any cryptosystem that is build on top of them. Sridevi, International Journal of Computer Science and Mobile Computing, Vol.3 Issue.9, September2014, pg. 703-714 © 2014, IJCSMC All Rights Reserved 704
منابع مشابه
Stream ciphers and the eSTREAM project
Stream ciphers are an important class of symmetric cryptographic algorithms. The eSTREAM project contributed significantly to the recent increase of activity in this field. In this paper, we present a survey of the eSTREAM project. We also review recent time/memory/data and time/memory/key trade-offs relevant for the generic attacks on stream ciphers.
متن کاملTwo Practical and Provably Secure Block Ciphers: BEAR and LION
In this paper we suggest two new provably secure block ciphers , called BEAR and LION. They both have large block sizes, and are based on the Luby-Rackoo construction. Their underlying components are a hash function and a stream cipher, and they are provably secure in the sense that attacks which nd their keys would yield attacks on one or both of the underlying components. They also have the p...
متن کاملCryptanalytic Time-Memory-Data Tradeoffs for FX-Constructions with Applications to PRINCE and PRIDE
The FX-construction was proposed in 1996 by Kilian and Rogaway as a generalization of the DESX scheme. The construction increases the security of an n-bit core block cipher with a κ-bit key by using two additional n-bit masking keys. Recently, several concrete instances of the FX-construction were proposed, including PRINCE (proposed at Asiacrypt 2012) and PRIDE (proposed at CRYPTO 2014). These...
متن کاملTwo Practical and Provably Secure Block Ciphers: BEARS and LION
In this paper we suggest two new provably secure block ciphers , called BEAR and LION. They both have large block sizes, and are based on the Luby-Rackoo construction. Their underlying components are a hash function and a stream cipher, and they are provably secure in the sense that attacks which nd their keys would yield attacks on one or both of the underlying components. They also have the p...
متن کامل